package com.leetcode.p100;

public class Test152 {

    public int maxProduct(int[] nums) {
//        int max = nums[0];

//        int sum = max;

        int[] dp = new int[nums.length];
        dp[0] = nums[0];

        for (int i = 1; i < nums.length; i++) {

        }

//        return max;
        return 1;
    }

    public static void main(String[] args) {
        Test152 test = new Test152();
        //TODO
        int result = test.maxProduct(new int[]{2, 3, -2, 4});
        System.out.println(result);
    }

}
